Specifications via Realizability
نویسندگان
چکیده
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing their realizability interpretations in the ML language augmented with assertions (as comments). While the system is best suited for descriptions of those data structures that can be easily described in mathematical language (e.g., finitely presented groups, real arithmetic, graphs, etc.), it also elucidates the relationship between data structures and constructive mathematics.
منابع مشابه
Realizability Toposes from Specifications
We investigate a framework of Krivine realizability with I/O effects, and present a method of associating realizability models to specifications on the I/O behavior of processes, by using adequate interpretations of the central concepts of pole and proof-like term. This method does in particular allow to associate realizability models to computable functions. Following recent work of Streicher ...
متن کاملStudy about Realizability Situation and Utilization Contexts of Water Sensitive Urban Design
Climate changes, failure to complete the natural cycle of water in the city due to unsustainableconstruction of the urban environments and increase of impervious surfaces, lack of nutrition of undergroundaquifer in the cities, unsustainable management of stormwater and the floods due to them in the periods of rainfallcaused to provide an approach that is called water sensitive urban design. Thi...
متن کاملAnalysis of Realizability Conditions for Web Service Choreographies
Web service choreography languages allow for the description of multipart collaborations from a global point of view, specifying the information exchanged by the participants in order to accomplish a common business goal. An important issue, emerging from the choreography modelling, is the protocol realizability, i.e., the possibility to extract the local specifications of the participants, so ...
متن کاملRealizable and Unrealizable Specifications of Reactive Systems
2 The General Case 2 2.1 Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Realizable Specifications . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Realizability Under Fairness . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Weakly Realizable Specifications . . . . . . . . . . . . . . . . . . . . . 6 2.5 Games and Specifications . . . . . . . . . . ...
متن کاملRealizability Criteria for Compositional MSC
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic specifications, realizability criteria have been identified, such as non-local choice. In this work we develop a formal framework to study realizability of compositional MSC [GMP03]. We use it to derive a complete classif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 153 شماره
صفحات -
تاریخ انتشار 2006